LCA

Generalized Labeled LCA Queries

Making LCA More Efficient

Life Cycle Assessment (LCA) has gained attention because it enables quantitative evaluation of the burden a product places on the environment. However, acceptance of LCA has proceeded slowly because a large amount of work is required to gather the environmental burden data used in the evaluation. To shorten this work time, we utilize readily-accessible databases both internal and external to th...

Main Characteristics of LCA

Life cycle assessment (LCA) has a number of defining characteristics that enables it to address questions that no other assessment tools can address. This chapter begins by demonstrating how the use of LCA in the late 2000s led to a drastic shift in the dominant perception that biofuels were “green”, “sustainable” or “carbon neutral”, which led to a change in biofuel policies. This is followed ...

The LCA Problem Revisited

We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin [1].

Lowest Common Ancestor(LCA)

Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...